An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times

This paper presents an enhanced heuristic for minimizing the makespan of the ow shop scheduling problem with sequence-dependent setup times. The procedure transforms an instance of the problem into an instance of the traveling salesman problem by introducing a cost function that penalizes for both large setup times and bad tness of schedule. This hybrid cost function is an improvement over earlier approaches that penalized for setup times only, ignoring the ow shop aspect of the problem. To establish good parameter values, each component of the heuristic was evaluated computationally over a wide range of problem instances. In the testing stage, an experimental comparison with a greedy randomized adaptive search procedure revealed the conditions and data attributes where the proposed procedure works best.